Effectively Monadic Predicates
نویسندگان
چکیده
Monadic predicates play a prominent role in many decidable cases, including decision procedures for symbolic automata. We are here interested in discovering whether a formula can be rewritten into a Boolean combination of monadic predicates. Our setting is quantifier-free formulas over a decidable background theory, such as arithmetic and we here develop a semi-decision procedure for extracting a monadic decomposition of a formula when it exists.
منابع مشابه
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat,<) is decidable. A natural question is: what monadic predicates (sets) can be added to (Nat,<) while preserving decidability? Elgot and Rabin found many interesting predicates P for which the monadic theory of 〈Nat,<,P〉 is decidable. The Elgot and Rabin automata theoretical method has b...
متن کاملOn countable chains having decidable monadic theory
Rationals and countable ordinals are important examples of structures with decidable monadic second-order theories. A chain is an expansion of a linear order by monadic predicates. We show that if the monadic second-order theory of a countable chain C is decidable then C has a non-trivial expansion with decidable monadic second-order theory.
متن کاملLogical Definability of NP-Optimization Problems with Monadic Auxiliary Predicates
Given a rst{order formula ' with predicate symbols e 1 such a solution is deened to be jS 0 j. In a strong sense, every polynomially bounded NP{optimisation problem has such a representation, however, it is shown here that this is no longer true if the predicates s 1 ; : : : ; s r are restricted to be monadic. The result is proved by an Ehrenfeucht{Fra ss e game and remains true in several more...
متن کاملDefining "Good" and "Bad" in Terms of "Better"
Monadic predicates for "good" and "bad" are inserted into structures already containing the dyadic predicate "better". A set of logical properties for "good" and "bad" is proposed, and a complete characterization is given of the pairs of monadic predicates that have these properties. It is argued that "good" and "bad" can indeed be defined in terms of "better", and a definition is given that is...
متن کاملInfinite and Bi-infinite Words with Decidable Monadic Theories
We study word structures of the form (D,<,P ) where D is either N or Z, < is the natural linear ordering on D and P ⊆ D is a predicate on D. In particular we show: (a) The set of recursive ω-words with decidable monadic second order theories is Σ3complete. (b) Known characterisations of the ω-words with decidable monadic second order theories are transfered to the corresponding question for bi-...
متن کامل